منابع مشابه
Shadowing in Higher Dimensions
This paper presents methods using algebraic topology for showing that pseudo-trajectories are close to trajectories of a dynamical system. Our emphasis is the case where the trajectories are unstable in two or more dimensions. We develop the algebraic topology for guaranteeing the existence of such trajectories.
متن کاملBosonization in Higher Dimensions
Using the recently discovered connection between bosonization and duality transformations, we give an explicit path-integral representation for the bosonization of a massive fermion coupled to a U(1) gauge potential (such as electromagnetism) in d ≥ 2 space (D = d + 1 ≥ 3 spacetime) dimensions. We perform this integral explicitly in the limit of large fermion mass. We find that the bosonic theo...
متن کاملRendezvous in Higher Dimensions
Two players are placed on the integer lattice Z (consisting of points in n dimensional space with all coordinates integers) so that their vector difference is of length 2 and parallel to one of the axes. Their aim is to move to an adjacent node in each period, so that they meet (occupy same node) in least expected time R (n) , called the Rendezvous Value. We assume they have no common notion of...
متن کاملExtenics in Higher Dimensions
Dr. Cai Wen defined in his 1983 paper: the distance formula between a point x0 and an one-dimensional (1D) interval ; and the dependence function which gives the degree of dependence of a point with respect to a pair of included 1D-intervals. His paper inspired us to generalize the Extension Set to two-dimensions, i.e. in plane of real numbers R where one has a rectangle (instead of a seg...
متن کاملEfficient Approximation Algorithms for Point-set Diameter in Higher Dimensions
We study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The European Physical Journal C
سال: 2018
ISSN: 1434-6044,1434-6052
DOI: 10.1140/epjc/s10052-018-5546-1